Baire and Automata
نویسندگان
چکیده
In his thesis Baire defined functions of Baire class 1. A function f is of Baire class 1 if it is the pointwise limit of a sequence of continuous functions. Baire proves the following theorem. A function f is not of class 1 if and only if there exists a closed nonempty set F such that the restriction of f to F has no point of continuity. We prove the automaton version of this theorem. An ω-rational function is not of class 1 if and only if there exists a closed nonempty set F recognized by a Büchi automaton such that the restriction of f to F has no point of continuity. This gives us the opportunity for a discussion on Hausdorff’s analysis of ∆2, ordinals, transfinite induction and some applications of computer science.
منابع مشابه
Automata, Borel functions and real numbers in Pisot base
This note is about functions f : Aω → Bω whose graph is recognized by a Büchi finite automaton on the product alphabet A×B. These functions are Baire class 2 in the Baire hierarchy of Borel functions and it is decidable whether such fonction are continuous or not. In 1920 W. Sierpinski showed that a function f : R → R is Baire class 1 if and only if both the overgraph and the undergraph of f ar...
متن کاملPlaying Games in the Baire Space
We solve a generalized version of Church’s Synthesis Problem where a play is given by a sequence of natural numbers rather than a sequence of bits; so a play is an element of the Baire space rather than of the Cantor space. Two players Input and Output choose natural numbers in alternation to generate a play. We present a natural model of automata (“N-memory automata”) equipped with the parity ...
متن کاملA note on Volterra and Baire spaces
In Proposition 2.6 in (G. Gruenhage, A. Lutzer, Baire and Volterra spaces, textit{Proc. Amer. Math. Soc.} {128} (2000), no. 10, 3115--3124) a condition that every point of $D$ is $G_delta$ in $X$ was overlooked. So we proved some conditions by which a Baire space is equivalent to a Volterra space. In this note we show that if $X$ is a monotonically normal $T_1...
متن کاملDeterminacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk)
Determinacy of infinite two-player games is a topic of descriptive set theory that has triggered intensive research in theoretical computer science since 1957 when A. Church formulated his “synthesis problem” (regarding the construction of circuits with infinite behavior from logical specifications). In the first part of the lecture we review the fascinating development of the algorithmic theor...
متن کاملProducts , the Baire category theorem , and the axiom of dependent choice
In ZF (i.e., Zermelo-Fraenkel set theory without the Axiom of Choice) the following statements are shown to be equivalent: (1) The axiom of dependent choice. (2) Products of compact Hausdorff spaces are Baire. (3) Products of pseudocompact spaces are Baire. (4) Products of countably compact, regular spaces are Baire. (5) Products of regular-closed spaces are Baire. (6) Products of Čech-complete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2007